Minimum Density Hyperplanes
نویسندگان
چکیده
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is a central assumption in statistical and machine learning approaches for the classification of unlabelled data. In unsupervised classification this cluster definition underlies a nonparametric approach known as density clustering. In semi-supervised classification, class boundaries are assumed to lie in regions of low density, which is equivalent to assuming that high-density clusters are associated with a single class. We propose a novel hyperplane classifier for unlabelled data that avoids splitting high-density clusters. The minimum density hyperplane minimises the integral of the empirical probability density function along a hyperplane. The link between this approach and density clustering is immediate. We are able to establish a link between the minimum density and the maximum margin hyperplanes, thus linking this approach to maximum margin clustering and semi-supervised support vector machine classifiers. We propose a globally convergent algorithm for the estimation of minimum density hyperplanes for unsupervised and semi-supervised classification. The performance of the proposed approach for unsupervised and semi-supervised classification is evaluated on a number of benchmark datasets and is shown to be very promising.
منابع مشابه
AN UPPER BOUND ON DENSITY FOR PACKINGS OF COLLARS ABOUT HYPERPLANES IN Hn
We consider packings of radius r collars about hyperplanes in H. For such packings, we prove that the Delaunay cells are truncated ultra-ideal simplices which tile H. If we place n+1 hyperplanes in H each at a distance of exactly 2r to the others, we could place radius r collars about these hyperplanes. The density of these collars within the corresponding Delaunay cell is an upper bound on den...
متن کاملApproximation Algorithms for Minimizing Empirical Error by Axis-Parallel Hyperplanes
Many learning situations involve separation of labeled training instances by hyperplanes. Consistent separation is of theoretical interest, but the real goal is rather to minimize the number of errors using a bounded number of hyperplanes. Exact minimization of empirical error in a high-dimensional grid induced into the feature space by axis-parallel hyperplanes is NP-hard. We develop two appro...
متن کاملMultidimensional Signal Space Partitioning Using a Minimal Set of Hyperplanes for Detecting ISI-corr - Communications, IEEE Transactions on
A signal space partitioning technique is presented for detecting symbols transmitted through intersymbol interference channels. The decision boundary is piecewise linear and is made up of several hyperplanes. The goal here is to minimize the number of hyperplanes for a given performance measure, namely, the minimum distance between any signal and the decision boundary. Unlike in Voronoi partiti...
متن کاملfinding the defining hyperplanes of production possibility set with variable returns to scale using the linear independent vectors
The Production Possibility Set (PPS) is defined as the set of all inputs and outputs of a system in which inputs can produce outputs. In Data Envelopment Analysis (DEA), it is highly important to identify the defining hyperplanes and especially the strong defining hyperplanes of the empirical PPS. Although DEA models can determine the efficiency of a Decision Making Unit (DMU), but they...
متن کاملOn the Zariski-Density of Integral Points on a Complement of Hyperplanes in Pn
We study the S-integral points on the complement of a union of hyperplanes in projective space, where S is a finite set of places of a number field k. In the classical case where S consists of the set of archimedean places of k, we completely characterize, in terms of the hyperplanes and the field k, when the (S-)integral points are not Zariski-dense.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Machine Learning Research
دوره 17 شماره
صفحات -
تاریخ انتشار 2016